Some Preconditioning Techniques for Linear Systems
نویسنده
چکیده
New convergence intervals of parameters αi are derived and applied for solving the modified linear systems, which enables a better understanding of how parameters should be chosen. The convergence theorem for H-matrix is given. Meanwhile, we discuss the convergence results forM -matrices linear systems and give some new preconditioners. Numerical examples are used to illustrate our results. Key–Words: Convergence, H-matrix,M -matrix, Preconditioner, Gauss-Seidel method
منابع مشابه
Solving large systems arising from fractional models by preconditioned methods
This study develops and analyzes preconditioned Krylov subspace methods to solve linear systems arising from discretization of the time-independent space-fractional models. First, we apply shifted Grunwald formulas to obtain a stable finite difference approximation to fractional advection-diffusion equations. Then, we employee two preconditioned iterative methods, namely, the preconditioned gen...
متن کاملTR-2007002: Additive Preconditioning and Aggregation in Matrix Computations
Multiplicative preconditioning is a popular SVD-based techniques for the solution of linear systems of equations, but our SVD-free additive preconditioners are more readily available and better preserve matrix structure. We combine additive preconditioning with aggregation and other relevant techniques to facilitate the solution of linear systems of equations and some other fundamental matrix c...
متن کاملPreconditioning Techniques in Linear Model Order Reduction
Krylov subspace methods have become very popular, not only for solving large scale linear systems, but also in the area of model order reduction. It is also well known that the performance of iterative solution techniques depends crucially on the choice of preconditioning matrix. Within the area of model order reduction, the concept of preconditioning has not yet been introduced. However, recen...
متن کاملTR-2007003: Additive Preconditioning for Matrix Computations
Multiplicative preconditioning is a popular SVD-based techniques for the solution of linear systems of equations. Our novel SVD-free additive preconditioners are more readily available and better preserve matrix structure. We study their generation and their affect on conditioning of the input matrix. In other papers we combine additive preconditioning with aggregation and other relevant techni...
متن کاملAn Assessment of Some Preconditioning Techniques in Shell Problems
Preconditioned Krylov subspace methods have proved to be ecient in solving large, sparse linear systems in many areas of scienti®c computing. The success of these methods in many cases is due to the existence of good preconditioning techniques. In problems of structural mechanics, like the analysis of heat transfer and deformation of solid bodies, iterative solution of the linear equation syst...
متن کاملParallel two level block ILU preconditioning techniques for solving large sparse linear systems
We discuss issues related to domain decomposition and multilevel preconditioning techniques which are often employed for solving large sparse linear systems in parallel computations. We introduce a class of parallel preconditioning techniques for general sparse linear systems based on a two level block ILU factorization strategy. We give some new data structures and strategies to construct loca...
متن کامل